Sparse LU factorization on the CRAY T3D
نویسندگان
چکیده
The paper describes a parallel algorithm for the LU fac-torization of sparse matrices on distributed memory machines by using SPMD as programming model and PVM as message passing interface. We address all the diiculties arising in sparse codes, as the ll-in or the dynamic movement of data inside the matrix. The cyclic distribution has been used to evenly distribute the elements onto a mesh of processors, whereas two local storage schemes are proposed: A semi-ordered and two-dimensional linked list, which fullls better the requirements of the algorithm, and a compressed storage by rows, which behaves better in the use of memory. The properties of the code are extensively analyzed and execution times on the CRAY T3D are presented to illustrate the overall eeciency achieved by our methods.
منابع مشابه
Parallel Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures
Gaussian elimination based sparse LU factorization with partial pivoting is important to many scientiic applications, but it is still an open problem to develop a high performance sparse LU code on distributed memory machines. The main diiculty is that partial pivoting operations make structures of L and U factors unpredictable beforehand. This paper presents an approach called S for paralleliz...
متن کاملEfficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures
A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientific applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main difficulty is that partial pivoting operations dynamically change computation and nonzero fill-in structures during the elimination process. This paper p...
متن کاملEecient Sparse Lu Factorization with Partial Pivoting on Distributed Memory Architectures
A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientiic applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main diiculty is that partial pivoting operations dynamically change computation and nonzero ll-in structures during the elimination process. This paper presen...
متن کاملA Comparison of 1-D and 2-D Data Mapping for Sparse LU Factorization with Partial Pivoting
This paper presents a comparative study of two data mapping schemes for parallel sparse LU factorization with partial pivoting on distributed memory machines. Our previous work has developed an approach that incorporates static symbolic factoriza-tion, nonsymmetric L/U supernode partitioning and graph scheduling for this problem with 1-D column-block mapping. The 2-D mapping is commonly conside...
متن کاملHighly Scalable Parallel Algorithms for Sparse Matrix Factorization
In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a Cray T3D parallel computer. Through our analysis and experimental results, we demonstrate that our algorithms substantially improve the state of the art in parallel direct solution of sparse linear sys...
متن کامل